Complexity of regular invertible p-adi motions

نویسندگان

  • J Pettigrew
  • J A G Roberts
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of regular invertible p-adic motions.

We consider issues of computational complexity that arise in the study of quasi-periodic motions (Siegel discs) over the p-adic integers, where p is a prime number. These systems generate regular invertible dynamics over the integers modulo p(k), for all k, and the main questions concern the computation of periods and orbit structure. For a specific family of polynomial maps, we identify condit...

متن کامل

Some properties of Invertible Elements in Fuzzy Banach algebras

In this paper, we introduce fuzzy Banach algebra and study the properties of invertible elements and its relation with opensets. We obtain some interesting results.

متن کامل

Diagonal Matrix Reduction over Refinement Rings

  Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement.  Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N  if and only if Mm ~Nm for all maximal ideal m of  R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...

متن کامل

Beam Collimation during Lumbar Spine Radiography: A Retrospective Study

Introduction: Collimating the primary beam to the area of diagnostic interest (ADI) has been strongly recommended as an effective method to reduce patient’s radiation dose and to improve image quality during radiology practice. Lack or inadequate collimation results in excessive radiation dose to patients and deterioration image quality.Objective: To assess the quality of beam collimation dur...

متن کامل

Invertible insertion and deletion operations.dvi

The paper investigates the way in which the property of a language operation ⋄ ”to be invertible” helps in solving language equations of the type L⋄Y = R. In the beginning, the simple case where ⋄ denotes catenation is studied, but the results are then generalized for various invertible insertion and deletion operations. For most of the considered operations ⋄, the problem ”Does there exist a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007